Approximation properties for solutions to non‐Lipschitz stochastic differential equations with Lévy noise

In this paper, we consider the non‐Lipschitz stochastic differential equations and stochastic functional differential equations with delays driven by Lévy noise, and the approximation theorems for the solutions to these two kinds of equations will be proposed respectively. Non‐Lipschitz condition is much weaker condition than the Lipschitz one. The simplified equations will be defined to make its solutions converge to that of the corresponding original equations both in the sense of mean square and probability, which constitute the approximation theorems. Copyright © 2014 John Wiley & Sons, Ltd.     

END样本最近邻密度估计的强相合速度

本文研究了扩展负相依(END)样本最近邻密度估计的强相合性问题.利用END序列的Bernstein型不等式和截尾的方法,获得了END样本最近邻密度估计的强相合速度,推广了NA样本和ND样本最近邻密度估计的相应结果.     

Nonlocal Interaction Equations in Environments with Heterogeneities and Boundaries

We study well-posedness of a class of nonlocal interaction equations with spatially dependent mobility. We also allow for the presence of boundaries and external potentials. Such systems lead to the study of nonlocal interaction equations on subsets ? of ? ^d endowed with a Riemannian metric g. We obtain conditions, relating the interaction potential and the geometry, which imply existence, uniqueness and stability of solutions. We study the equations in the setting of gradient flows in the space of probability measures on ? endowed with Riemannian 2-Wasserstein metric.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Weak Euler Approximation for Itô Diffusion and Jump Processes

This article studies the rate of convergence of the weak Euler approximation for Itô diffusion and jump processes with Hölder-continuous generators. It covers a number of stochastic processes including the nondegenerate diffusion processes and a class of stochastic differential equations driven by stable processes. To estimate the rate of convergence, the existence of a unique solution to the corresponding backward Kolmogorov equation in Hölder space is first proved. It then shows that the Euler scheme yields positive weak order of convergence.     

Numerical solution of one‐dimensional Burgers' equation

In this article, an iterative method for the approximate solution of a class of Burgers' equation is obtained in reproducing kernel space . It is proved the approximation converges uniformly to the exact solution u(x, t) for any initial function under trivial conditions, the derivatives of are also convergent to the derivatives of u(x, t), and the approximate solution is the best approximation under the system © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1251–1264, 2015     

An efficient meshfree point collocation moving least squares method to solve the interface problems with nonhomogeneous jump conditions

We are going to study a simple and effective method for the numerical solution of the closed interface boundary value problem with both discontinuities in the solution and its derivatives. It uses a strong‐form meshfree method based on the moving least squares (MLS) approximation. In this method, for the solution of elliptic equation, the second‐order derivatives of the shape functions are needed in constructing the global stiffness matrix. It is well‐known that the calculation of full derivatives of the MLS approximation, especially in high dimensions, is quite costly. In the current work, we apply the diffuse derivatives using an efficient technique. In this technique, we calculate the higher‐order derivatives using the approximation of lower‐order derivatives, instead of calculating directly derivatives. This technique can improve the accuracy of meshfree point collocation method for interface problems with nonhomogeneous jump conditions and can efficiently estimate diffuse derivatives of second‐ and higher‐orders using only linear basis functions. To introduce the appropriate discontinuous shape functions in the vicinity of interface, we choose the visibility criterion method that modifies the support of weight function in MLS approximation and leads to an efficient computational procedure for the solution of closed interface problems. The proposed method is applied for elliptic and biharmonic interface problems. For the biharmonic equation, we use a mixed scheme, which replaces this equation by a coupled elliptic system. Also the application of the present method to elasticity equation with discontinuities in the coefficients across a closed interface has been provided. Representative numerical examples demonstrate the accuracy and robustness of the proposed methodology for the closed interface problems. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1031–1053, 2015     

非齐次树上马氏链的若干强偏差定理

通过构造适当的非负鞅,将Doob鞅收敛定理应用于几乎处处收敛的研究,给出了一类非齐次树上马氏链场加权和滑动平均的若干强偏差定理.     

Distribution function estimates by Wasserstein metric and Bernstein approximation for C-1 functions

The aim of the paper is to estimate the density functions or distribution functions measured by Wasserstein metric, a typical kind of statistical distances, which is usually required in the statistical learningBased on the classical Bernstein approximation, a scheme is presented.To get the error estimates of the scheme, the problem turns to estimating the L1 norm of the Bernstein approximation for monotone C-1functions, which was rarely discussed in the classical approximation theoryFinally, we get a probability estimate by the statistical distance.